Edsger W. Dijkstra - PDFSEARCH.IO - Document Search Engine

Edsger W. Dijkstra
Results: 213

#	Item
71	Exercise 9: It’s Christmas time! Task 1: Self-stabilization survey a) Check out the algorithms from the lecture and the exercises. Make a table, marking each1 of them as one of the following: (i) trivially self-stabili Add to Reading List Source URL: resources.mpi-inf.mpg.de Language: English - Date: 2014-12-16 13:13:08 Edsger W. Dijkstra Fault-tolerant computer systems Theoretical computer science Self-stabilization Cosmina Algorithm Merry Christmas Christmas
72	Twig Patterns: From XML Trees to Graphs ∗ [Extended Abstract] Benny Kimelfeld and Yehoshua Sagiv Add to Reading List Source URL: db.ucsd.edu Language: English - Date: 2007-05-03 17:07:15 Combinatorial optimization Network theory Edsger W. Dijkstra Routing algorithms Spanning tree Shortest path problem Matching Graph database Sharp-P-completeness of 01-permanent Centrality
73	COLD: PoP-level Network Topology Synthesis Rhys Bowden Matthew Roughan Nigel Bean Add to Reading List Source URL: conferences2.sigcomm.org Language: English - Date: 2014-12-01 16:56:35 Network theory Networks Edsger W. Dijkstra Electrical engineering Electronic engineering Topology Routing Network topology Shortest path problem Hub Computer network Network science
74	See discussions, stats, and author profiles for this publication at: http://www.researchgate.net/publicationdirectP ath : An Expert Path Planning Framework to Handle Environment Knowledge CONFERENCE PAPER · Add to Reading List Source URL: people.ee.ethz.ch Language: English - Date: 2015-11-24 05:27:24 Routing algorithms Edsger W. Dijkstra Game artificial intelligence Combinatorial optimization Search algorithms A* search algorithm Motion planning Shortest path problem Pathfinding
75	The Structure of the "THE"-Multiprogramming System Edsger W . Dijkstra Technological University, Eindhoven, The Netherlands A multiprogramming system is described in which all activities are divided over a number of sequ Add to Reading List Source URL: www.eecs.harvard.edu Language: English Edsger W. Dijkstra Concurrency control Semaphore Synchronization Mutual exclusion Actor model THE multiprogramming system Flag semaphore Lock Critical section Monitor Sleeping barber problem
76	The Optimism Principle: A Unified Framework for Optimal Robotic Network Deployment in An Unknown Obstructed Environment Shangxing Wang1 , Bhaskar Krishnamachari1 and Nora Ayanian2 Abstract— We consider the problem of d Add to Reading List Source URL: anrg.usc.edu Language: English - Date: 2015-08-18 02:29:19 Edsger W. Dijkstra Motion planning Theoretical computer science Robot Mobile robot Shortest path problem Emerging technologies Self-reconfiguring modular robot
77	Fault-Tolerant Aggregation by Flow Updating Paulo Jesus, Carlos Baquero, and Paulo S´ergio Almeida University of Minho (CCTC-DI) Campus de Gualtar, Braga, Portugal {pcoj, cbm, psa}@di.uminho.pt Add to Reading List Source URL: gsd.di.uminho.pt Language: English - Date: 2015-03-13 12:52:43 Routing algorithms Distributed data storage Edsger W. Dijkstra Distributed computing Distributed hash table File sharing Routing Distributed algorithm Kademlia Belief propagation
78	Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks (Extended Abstract) Mordechai Shalom1,3 , Prudence W.H. Wong2 , and Shmuel Zaks1, 1 Add to Reading List Source URL: cgi.csc.liv.ac.uk Language: English - Date: 2007-09-10 05:50:03 Combinatorial optimization Routing algorithms Matching Edsger W. Dijkstra Search algorithms Game artificial intelligence
79	Exercise 2: Flirting with Synchrony and Asynchrony Task 1: Growing Balls Denote by B(v, r) the ball of radius r around v, i.e., B(v, r) = {u ∈ V : dist(u, v) ≤ r}. Consider the following partitioning algorithm. Algor Add to Reading List Source URL: resources.mpi-inf.mpg.de Language: English - Date: 2014-10-28 15:42:59 Algorithm Mathematical logic Theoretical computer science Edsger W. Dijkstra Spanning tree Graphical models
80	Finding Graph Topologies for Feasible Multirobot Motion Planning Pushkar Kolhe Henrik I. Christensen Abstract— In this paper we present a design methodology Add to Reading List Source URL: www.researchgate.net Language: English Edsger W. Dijkstra Routing algorithms Graph theory Game artificial intelligence Search algorithms Shortest path problem Topology Pathfinding A* search algorithm Minimum spanning tree Visibility graph Motion planning

UPDATE